Structure Indicators for Transportation Graph Analysis I: Planar Connected Simple Graphs
نویسندگان
چکیده
منابع مشابه
connected graphs cospectral with a friendship graph
let $n$ be any positive integer, the friendship graph $f_n$ consists of $n$ edge-disjoint triangles that all of them meeting in one vertex. a graph $g$ is called cospectral with a graph $h$ if their adjacency matrices have the same eigenvalues. recently in href{http://arxiv.org/pdf/1310.6529v1.pdf}{http://arxiv.org/pdf/1310.6529v1.pdf} it is proved that if $g$ is any graph cospectral with $f_n$...
متن کاملA Well-Connected Separator for Planar Graphs
We prove a separator theorem for planar graphs, which has been used to obtain polynomial time approximation schemes for the metric TSP [8] and the 2edge-connected and biconnected spanning subgraph problems [6] in unweighted planar graphs. We also prove an extension of the theorem which was used in [3] to find quasi-polynomial time approximation schemes for the weighted cases of the latter two p...
متن کاملGraph Voronoi Regions for Interfacing Planar Graphs
Commanding motion is supported by a touch screen interface. Human input demonstrating trajectories by a sequence of points may be incomplete, distorted etc. Theses e ects are compensated by a transformation of vertex sequences of a regular grid into paths of a planar graph which codes feasible motions. The transformation is based on alteration operations including re-routings and on a so-called...
متن کاملA Simple Test for Planar Graphs
Given an undirected graph, the planarity testing problem is to determine whether the graph can be drawn in the plane without any crossing edges. Linear time planarity testing algorithms have previously been designed by Hopcroft and Tarjan, and by Booth and Lueker. However, their approaches are quite involved. We develop a very simple linear time testing algorithm based only on a depth-first sea...
متن کاملTwo-Connected Augmentation Problems in Planar Graphs
Given an weighted undirected graph G and a subgraph S of G, we consider the problem of adding a minimum-weight set of edges of G to S so that the resulting subgraph satisses speciied (edge or vertex) connectivity requirements between pairs of nodes of S. This has important applications in upgrading telecommunications networks to be invulnerable to link or node failures. We give a polynomial alg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Networks and Spatial Economics
سال: 2015
ISSN: 1566-113X,1572-9427
DOI: 10.1007/s11067-015-9318-2